System and method for processing images

ABSTRACT

A method of processing a plurality of time separated images comprises selecting a plurality of imaging units in each image; measuring a temporal difference in each imaging unit; and selecting temporal differences above a threshold limit.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 61/102,206 to Lee filed on Oct. 2, 2008 and entitled “SYSTEM AND METHOD FOR PROCESSING IMAGES”, the content of which is incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates generally to image processing and, more particularly, to a system and method for processing image data obtained by using a dynamic imaging technique

BACKGROUND OF THE INVENTION

Medical imaging encompasses techniques and processes used to create images of the human body for clinical purposes, including medical procedures for diagnosing or monitoring disease. Medical imaging technology has grown to encompass many image recording techniques including electron microscopy, fluoroscopy, magnetic resonance imaging (MRI), nuclear medicine, photoacoustic imaging, positron emission tomography (PET), projection radiography, thermography, computed tomography (CT), and ultrasound.

Medical imaging can incorporate the use of compounds referred to as contrast agents or contrast materials to improve the visibility of internal bodily structures in an Image.

Medical imaging was originally restricted to acquisition of singular static images to capture the anatomy of an organ/region of the body. Currently, the use of more sophisticated imaging techniques allows dynamic studies to be made that provide a temporal sequence of images which can characterize physiological or pathophysiological information.

Dynamic medical imaging involves an acquisition process that takes many “snapshots” of the organ/region/body of interest over time in order to capture a time-varying behaviour, for example, distribution of a contrast agent and hence capture of a specific biological state (disease, condition, physiological phenomenon, etc.). As the speed and digital nature of medical imaging evolves, this acquisition data can have tremendous temporal resolution and can result in large quantities of data.

Medical imaging technologies have been used widely to improve diagnosis and care for such conditions as cancer, heart disease, brain disorders, and cardiovascular conditions. Most estimates conclude that millions of lives have been saved or dramatically improved as a result of these medical imaging technologies. However, the risk of radiation exposure from such medical imaging technologies for patients must be considered.

In this regard, the increasing use of CT in medical diagnosis has highlighted concern about the increased cancer risk to exposed patients because of the larger radiation doses delivered in CT than the more common, conventional x-ray imaging procedures. This is particularly true with the two-phase CT Perfusion protocol. For illustration purposes, using the dose-length product for a protocol provided by a commercially available CT scanner (GE Healthcare), the effective dose of a CT Stroke series consisting of: 1) a non-enhanced CT scan to rule out hemorrhage; 2) a CT angiography to localize the occlusion causing the stroke; and 3) a two-phase CT Perfusion protocol to define the ischemic region with blood flow and blood volume and predict hemorrhagic transformation (HT) with blood-brain barrier permeability surface area product (BBB-PS); is 10 mSv, of which 4.9 mSv is contributed by the two-phase CT Perfusion protocol. The CT Stroke series is predicted to induce 80 and 131 additional cancers for every exposed 100,000 male and female acute ischemic stroke (AIS) patients, respectively, with the two-phase CT Perfusion protocol alone predicted to cause half of the additional cancers (Health Risks from Exposure to Low Levels of Ionizing Radiation: BEIR VII. The National Academies Press, Washington DC, 2006).

Unless the effective dose of the two-phase CT Perfusion protocol is reduced, the benefits of medical imaging will be undermined by the concern over cancer induction. Furthermore, the concern over the risks of radiation exposure extends to other medical imaging techniques, particularly for pediatric patients or those patients undergoing repeated exposure.

The use of statistical filtering techniques to increase the signal to noise ratio in low dose radiation imaging has been described, for example in U.S. Pat. No. 7,187,794 issued Mar. 6, 2007. However, at present the application of statistical filtering is limited to projection data prior to the construction of images. Several disadvantages are associated with statistical filtering of projection data. For example, the computational burden when working with projection data is high because each image from a dynamic sequence is typically reconstructed from ˜1,000 projections. In addition, the filtering process has to be ‘hardwired’ into the image reconstruction pipeline of the scanner. As such, statistical filters of projection data lack flexibility as they are typically specific to a scanner platform.

Whether perceived or proven, concerns over the risk of radiation exposure will have to be addressed to assure patients of the long term safety of medical imaging techniques. Accordingly, there is a need for medical imaging techniques that allow for a reduction in radiation dose.

It is therefore an object of the present invention to provide a novel system and method for processing images.

SUMMARY OF THE INVENTION

In an aspect, there is provided a method of processing a plurality of time separated images comprising: selecting a plurality of imaging units in each image; determining a temporal difference for each imaging unit; and selecting temporal differences above a threshold limit.

In another aspect, there is provided a system for processing a plurality of time separated images comprising: an interface for receiving a plurality of time separated images; and a processor for selecting a plurality of imaging units in each image, determining a temporal difference for each imaging unit, and selecting temporal differences above a threshold limit.

In yet another aspect, there is provided a computer readable medium embodying a computer program for processing a plurality of time separated images, the computer program comprising: computer program code for selecting a plurality of imaging units in each image; computer program code for determining a temporal difference for each imaging unit; and computer program code for selecting temporal differences above a threshold limit.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments will now be described, by way of example only, with reference to accompanying drawings in which:

FIG. 1 is a flow chart of an image processing method;

FIG. 2 schematically illustrates the positioning of imaging units in a plurality of time separated images;

FIG. 3 shows brain blood flow maps (A) to (E) from CT images processed with a statistical filtering technique;

FIG. 4 graphically shows blood flow Figure of Merit calculated for the images shown in FIGS. 3A to 3D using the regions outlined in FIG. 3E; and

FIG. 5 is a diagram of a system for implementing the image processing method shown in FIG. 1.

DETAILED DESCRIPTION

Dynamic medical imaging involves an acquisition process that takes many “snapshots” of an organ/region/body of interest (i.e. a target region) over time in order to capture a time-varying behaviour, for example uptake and/or wash out of a contrast agent. This acquisition process results in the production of a plurality of time separated images. The method and system described herein involves processing of such time separated images.

Turning now to FIG. 1, the steps performed during processing of time separated images according to the method are illustrated. The plurality of time separated images may be obtained from dynamic medical imaging of a patient with or without the use of an injected contrast agent. A contrast agent can selectively increase the contrast of the target region in an image, for example on the basis of the target region's structure or physiological state. For example, one may inject into a patient a compound which has a biophysical, molecular, genetic or cellular affinity for a particular organ, disease, state or physiological process. Such contrast agents are selected to have a property that provides enhanced information to a given imaging technique by altering imaging conditions, for example by altering image contrast, to reflect the behaviour of the compound in the body. This may be achieved via increased X-ray attenuation at a localized site (e.g. for CT/X-ray), altered paramagnetic properties (e.g. for MRI) or the use of a radioisotope for nuclear medicine/PET. Contrast agents for many imaging techniques are well-known. In some cases contrast enhancement does not rely on an injected contrast agent, for example the use of “black blood” or “white blood” in magnetic resonance imaging (MRI) where specific pulse sequences are used to change the magnetic saturation of the blood and thus its appearance in the image, or tagged MRI sequences which alter the magnetic behaviour of a particular tissue or fluid. An injected contrast agent, or a tissue or fluid with altered behaviour, may all be regarded as “imaging agents”.

The plurality of time separated images are not limited to any particular imaging technique and include, for example, dynamic medical imaging using magnetic resonance imaging (MRI), computed tomography (CT), nuclear medicine (NM) or positron emission tomography (PET). The plurality of time separated images are also not limited to particular image types. For example, grayscale or colour images may be processed.

During the method, within each time separated image a plurality of imaging units are selected (step 110). An “imaging unit” may be any desired unit for separating an image into equivalent portions including, for example, a pixel, a plurality of pixels, a fraction of a pixel, a voxel, a plurality of voxels, a fraction of a voxel etc.

The imaging unit data is represented by a value, for example a digital value, and can thus be quantified and measured. Typically, image intensity is measured for corresponding imaging units in the time separated images. For dynamic imaging using contrast agents a temporal difference can be determined with respect to contrast concentration. The temporal difference of contrast concentration can be represented as a plot of contrast enhancement as a function of time.

Two alternatives for determining temporal differences of contrast concentration and selecting temporal differences are shown in FIG. 1. In one alternative shown in FIG. 1, once the plurality of imaging units has been selected from each time separated image at step 110, a temporal difference is determined for each imaging unit (step 115). The determined temporal difference or representations thereof are then ranked according to degree of observed temporal difference (step 120). Temporal differences above a threshold limit are then selected (step 125). A processed image is then constructed on the basis of the selected temporal differences (step 150).

In the other alternative shown in FIG. 1, the temporal differences are not ranked. Rather, the temporal data for imaging units are analyzed to select temporal differences above a threshold limit using statistical techniques, and more particularly blind signal separation statistical techniques. For example, with respect to dynamic CT imaging using a contrast agent, once the plurality of imaging units have been selected from each time separated image at step 110, a covariance matrix of the co-variations of all pairs of contrast enhancement plots in relation to a mean curve is established (step 130) and analyzed with a blind signal separation statistical technique (step 135), such as with a principal components analysis being applied to the covariance matrix. Eigenvector/eigenvalue pairs are calculated on the basis of the statistical analysis (step 140). Resulting eigenvector/eigenvalue pairs above a threshold limit are then selected on the basis of their eigenvalues (step 145). A processed image is then constructed using the selected eigenvectors, with different weightings of the selected eigenvectors being used to construct individual imaging units (step 160).

The plurality of time separated images may optionally be registered to correlate corresponding locations in the time separated images to each other. Registration of the plurality of time separated images is only needed to correct for gross misregistration. Otherwise, slight movement between the time separated images may be tolerated and may even be removed by the processing method described herein.

As another optional step, the plurality of time separated images may be preprocessed so that the time separated images are represented with quantifiable values or codes. For example, the time separated images may be represented by digital values using known digitization techniques. If the imaging data of the plurality of time separated images is provided in a digital form, then a digitization step is not necessary.

The determination of temporal differences of contrast concentration will now be further described with reference to FIG. 2. FIG. 2 shows a series of six chronologically ordered time separated images, t₁ to t₆. A 4×6 array of imaging units is marked on each time separated image. In this example, five (5) imaging units, IU1 to IU5, have been selected. As is clear from comparing the entire series of time separated images. t₁ to t₆, imaging unit IU1 is selected at the same position of the array (i.e. column 1, row 2) for each of the time separated images. Similarly, each of imaging units IU2 to IU5 is selected in corresponding positions of the imaging unit array throughout the series of time separated images. Accordingly, values for each imaging unit at its corresponding position throughout the time separated images can be plotted as a function of time to obtain a temporal curve. The plotting step is illustrated by the arrows linking the corresponding positions of imaging units IU1, IU2 and IU5. The temporal curve for each imaging unit can then be analyzed to determine a temporal difference. For example, a mean curve for all of the temporal curves obtained can be calculated. The mean curve is then subtracted from each of the temporal curves to obtain a temporal difference curve for each selected imaging unit. It will be understood, that the marked array and the selection of imaging units IU1 to IU5, as well as the arrows representing plotting of values for imaging units IU1, IU2, and IU5 as a function of time, is for illustration purposes only, and that any number of imaging units may be selected and analyzed as desired. Furthermore, the determination of temporal differences by subtraction of a mean curve from the temporal curves for imaging units is for illustration only, and other methods of analyzing the temporal curves, for example using derivatives and/or statistical techniques are contemplated.

A mathematical basis for blind signal separation statistical analysis of a plurality of time separated images is now provided using time separated images from a CT Perfusion study as an example.

Given a series of n dynamic (i.e. time separated) images from a CT Perfusion study, the n dynamic images can be represented compactly as a matrix:

{tilde over (X)}=[{tilde over (x)} ₁ ^(T) {tilde over (x)} ₂ ^(T) . . . . . . {tilde over (x)} _(p−1) ^(T) {tilde over (x)} _(p) ^(T)]^(T)

where p is the number of pixels in a CT image (i.e. p=512×512, 258×258, etc) and {tilde over (x)}_(i), i=1, . . . , p is a n×1 vector whose elements are the pixel values in the n images or the time vs. enhancement curve from the i^(th) pixel. Note that the (i,j)^(th) element of {tilde over (X)} is the j^(th) element x_(ψ) of {tilde over (x)}_(i). Each {tilde over (x)}_(i), i=1, . . . ,p can also be interpreted as repeated observations of a single time vs. enhancement curve {tilde over (χ)} (a random process consisting of n random variables, χ₁, χ₂, . . . ,χ_(n−1), χ_(n)). Notation is interpreted as follows:

-   -   (i) a vector is represented by a tilde above a Greek or Roman         alphabet character with elements arranged in a column;     -   (ii) a matrix is represented by tilde over a capitalized Greek         or Roman alphabet character;     -   (iii) the transpose of a vector or a matrix is indicated by a         superscript T on the symbol; and     -   (iv) a random variable is represented by a Greek alphabet         character while an observation (samples) of a random variable is         represented by the corresponding Roman alphabet character; the         correspondence between Greek and Roman alphabet character will         be used as shown below in the following discussion:     -   χ         x     -   ψ         y     -   ζ         z     -   (v) a random process consisting of n random variables is         represented by a n×1 vector.

One approach to removing noise from the n dynamic images is to find an ‘expansion’ of the p×n matrix, {tilde over (X)}, and then truncate the expansion by certain pre-determined criteria. A common expansion is the singular value decomposition of {tilde over (X)};

{tilde over (X)}=Ũ·{tilde over (L)}·{tilde over (V)} ^(T)   (1)

where Ũ is a p×p orthogonal matrix, {tilde over (V)} is a n×n orthogonal matrix, and {tilde over (L)} is a p×n diagonal matrix with singular values of {tilde over (X)} as its diagonal elements. Let I_(i), . . . , I_(n) be the singular values of {tilde over (X)} (it is assumed without loss of generality that {tilde over (X)} is of full column rank, n and p>n). Then:

{tilde over (L)}=└Ĩ ₁ . . . Ĩ _(n)┘

where Ĩ_(i) i=1, . . . , n is a p×1 vector with zero elements except for the i^(th) element which is I_(l). Usually the singular values I₁, . . . , I_(n) are arranged in descending order and small singular values can be discarded as arising from noise. A simple way to reduce noise in {tilde over (X)} is to keep only r<n singular values. Then:

{tilde over (L)}=└Ĩ ₁ . . . I _(r) {tilde over (0)}_(r+1) . . . {tilde over (0)}_(n)┘

If the truncated series of singular values is used to reconstitute {tilde over (X)} according to Equation (1), then:

$\overset{\sim}{X} \approx {\left\lbrack {{\overset{\sim}{u}}_{1}\mspace{14mu} {\overset{\sim}{u}}_{2}\mspace{14mu} \ldots \mspace{14mu} {\overset{\sim}{u}}_{p}} \right\rbrack \cdot \left\lbrack {{\overset{\sim}{1}}_{1}\mspace{14mu} \ldots \mspace{14mu} {\overset{\sim}{1}}_{r}\mspace{14mu} {\overset{\sim}{0}}_{r + 1}\mspace{14mu} \ldots \mspace{11mu} {\overset{\sim}{0}}_{a}} \right\rbrack \cdot \begin{bmatrix} {\overset{\sim}{v}}_{1}^{T} \\ \vdots \\ {\overset{\sim}{v}}_{r}^{T} \\ {\overset{\sim}{v}}_{r + 1}^{T} \\ \vdots \\ {\overset{\sim}{v}}_{n}^{T} \end{bmatrix}}$

where ũ_(i) i=1, . . . ,p is the i^(th) column of Ũ and {tilde over (v)}_(i) i=1, . . . ,n is the i^(th) column of {tilde over (V)}. Evaluating the expansion, yields:

$\begin{matrix} \begin{matrix} {\overset{\sim}{X} \approx {\left\lbrack {{\overset{\sim}{u}}_{1}\mspace{14mu} {\overset{\sim}{u}}_{2}\mspace{14mu} \ldots \mspace{14mu} {\overset{\sim}{u}}_{p}} \right\rbrack \cdot \left\lbrack {{\overset{\sim}{1}}_{1}\mspace{14mu} \ldots \mspace{14mu} {\overset{\sim}{1}}_{r}\mspace{14mu} {\overset{\sim}{0}}_{r + 1}\mspace{14mu} \ldots \mspace{11mu} {\overset{\sim}{0}}_{a}} \right\rbrack \cdot \begin{bmatrix} {\overset{\sim}{v}}_{1}^{T} \\ \vdots \\ {\overset{\sim}{v}}_{r}^{T} \\ {\overset{\sim}{v}}_{r + 1}^{T} \\ \vdots \\ {\overset{\sim}{v}}_{n}^{T} \end{bmatrix}}} \\ {\approx {\left\lbrack {{\overset{\sim}{u}}_{1}\mspace{14mu} {\overset{\sim}{u}}_{2}\mspace{14mu} \ldots \mspace{14mu} {\overset{\sim}{u}}_{n}} \right\rbrack \cdot \left\lbrack {{\overset{\sim}{l_{1}} \cdot {\overset{\sim}{v}}_{1}^{\gamma}} + \ldots + {{\overset{\sim}{1}}_{r} \cdot {\overset{\sim}{v}}_{r}^{\gamma}}} \right\rbrack}} \\ {\approx {\left\lbrack {{\overset{\sim}{u}}_{1}\mspace{14mu} {\overset{\sim}{u}}_{2}\mspace{14mu} \ldots \mspace{14mu} {\overset{\sim}{u}}_{p}} \right\rbrack \cdot \left( {{\begin{bmatrix} l_{1} \\ \vdots \\ 0_{r} \\ 0_{r + 1} \\ \vdots \\ 0_{r} \end{bmatrix} \cdot {\overset{\sim}{Y}}_{1}^{\gamma}} + \ldots + {\begin{bmatrix} 0 \\ \vdots \\ l_{r} \\ 0_{r + 1} \\ \vdots \\ 0_{p} \end{bmatrix} \cdot {\overset{\sim}{v}}_{r}^{\gamma}}} \right)}} \\ {\approx {\left\lbrack {{\overset{\sim}{u}}_{1}\mspace{14mu} {\overset{\sim}{u}}_{2}\mspace{14mu} \ldots \mspace{14mu} {\overset{\sim}{u}}_{p}} \right\rbrack \cdot \begin{bmatrix} {l_{1} \cdot {\overset{\sim}{v}}_{1}^{t}} \\ \vdots \\ {l_{r} \cdot {\overset{\sim}{v}}_{r}^{\gamma}} \\ 0_{r + 1} \\ \vdots \\ 0_{p} \end{bmatrix}}} \\ {= {\sum\limits_{i = 1}^{r}{l_{i} \cdot {\overset{\sim}{u}}_{t} \cdot {\overset{\sim}{v}}_{t}^{\gamma}}}} \end{matrix} & (2) \end{matrix}$

Thus, in the expansion of {tilde over (X)}, keeping r singular values means that only the first r columns of Ũ and {tilde over (V)} is needed.

The singular value decomposition (SVD) (expansion) of {tilde over (X)} as formulated here, however, has two main disadvantages in de-noising dynamic images from CT Perfusion, namely:

1. The size of the matrix {tilde over (X)} can be as large as (256)^(2×)40-60, making it computationally prohibitive to find the SVD of {tilde over (X)}; and

2. Although the criterion of discarding small singular values makes general sense, if is difficult to justify the threshold used to keep or discard singular values.

An alternative method to achieve the SVD of {tilde over (X)}will now be described. As stated above, the time vs. enhancement curves from each pixel (or pixel block) {tilde over (x)}_(i),i=1, . . . ,p can be regarded as repeated samples (observations) of the underlying random process (time vs. enhancement curve) {tilde over (χ)}. Then the sample mean of the random process, x, can be calculated as:

$\begin{matrix} {\overset{\_}{x} = {\frac{1}{p} \cdot {\sum\limits_{i = 1}^{p}{\overset{\sim}{x}}_{i}}}} & (3) \end{matrix}$

{tilde over (x)} by definition is a n×1 vector (the sample mean time vs. enhancement curve) and the j^(th) component of x, according to Equation (3), is:

${\overset{\_}{x}}_{j} = {\frac{1}{p} \cdot {\sum\limits_{i = 1}^{p}{\overset{\sim}{x}}_{ij}}}$

where {tilde over (x)}_(ij) is the j^(th) component of {tilde over (x)}_(i). The zero mean random process from {tilde over (χ)} is , {tilde over (ψ)}={tilde over (χ)}−{tilde over (χ)}, where {tilde over (χ)} is the population mean of {tilde over (χ)}. For each observation (sample) {tilde over (x)}_(i) of {tilde over (χ)}, the corresponding observation (sample) of {tilde over (ψ)} is given by:

{tilde over (y)} _(i) ={tilde over (x)} _(i) − x.

The sample mean of {tilde over (ψ)}, {tilde over (y)}, a n×1 vector is given by:

$\overset{\_}{y} = {{\frac{1}{p} \cdot {\sum\limits_{i = 1}^{p}\overset{\sim}{y}}} = {{\frac{1}{p} \cdot {\sum\limits_{i = 1}^{p}\left( {\overset{\sim}{x},{- \overset{\_}{x}}} \right)}} = {{\left( {\frac{1}{p} \cdot {\sum\limits_{i = 1}^{p}x_{i}}} \right) - \overset{\_}{x}} = \overset{\sim}{0}}}}$

where {tilde over (0)} is a n×1 zero vector as expected since {tilde over (ψ)} is a zero mean random process,

Let {tilde over (Y)}=[{tilde over (y)}₁ ^(T)y₂ ^(T) . . . . . . {tilde over (y)}_(p−1) ^(T){tilde over (y)}_(p) ^(T)]^(T) be a p×n matrix whose rows are {tilde over (y)}_(i) ^(T)′i=1, . . . ,p. Then:

$\begin{matrix} \begin{matrix} {{{\overset{\sim}{Y}}^{T} \cdot \overset{\sim}{Y}} = {\left\lbrack {{\overset{\sim}{y}}_{1}\mspace{14mu} {\overset{\sim}{y}}_{2}\mspace{14mu} \ldots \mspace{14mu} \ldots \mspace{14mu} {\overset{\sim}{y}}_{p + 1}\mspace{20mu} {\overset{\sim}{y}}_{p}} \right\rbrack \cdot \begin{bmatrix} {\overset{\sim}{y}}_{1}^{T} \\ {\overset{\sim}{y}}_{2}^{T} \\ \vdots \\ \vdots \\ {\overset{\sim}{y}}_{p - 1}^{1} \\ {\overset{\sim}{y}}_{n}^{1} \end{bmatrix}}} \\ {= {\sum\limits_{i = 1}^{p}{{\overset{\sim}{y}}_{i} \cdot {\overset{\sim}{y}}_{i}^{1}}}} \\ {= {\sum\limits_{i = 1}^{p}\begin{bmatrix} {\overset{\sim}{y}}_{i\; 1}^{2} & {{\overset{\sim}{y}}_{i\; 1} \cdot {\overset{\sim}{y}}_{i\; 2}} & \ldots & \ldots & {{\overset{\sim}{y}}_{i\; 1} \cdot {\overset{\sim}{y}}_{{in} \cdot 1}} & {{\overset{\sim}{y}}_{i\; 1} \cdot {\overset{\sim}{y}}_{in}} \\ {{\overset{\sim}{y}}_{i\; 2} \cdot {\overset{\sim}{y}}_{i\; 1}} & {\overset{\sim}{y}}_{i\; 2}^{2} & \ldots & \ldots & {{\overset{\sim}{y}}_{i\; 2} \cdot {\overset{\sim}{y}}_{{in} - 1}} & {{\overset{\sim}{y}}_{i\; 2} \cdot {\overset{\sim}{y}}_{in}} \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ {{\overset{\sim}{y}}_{{in} \cdot 1} \cdot {\overset{\sim}{y}}_{i\; 1}} & {{\overset{\sim}{y}}_{{in} \cdot 1} \cdot {\overset{\sim}{y}}_{i\; 2}} & \; & \; & {\overset{\sim}{y}}_{{in} \cdot 1}^{1} & {{\overset{\sim}{y}}_{{in} \cdot 1} \cdot {\overset{\sim}{y}}_{i\; n}} \\ {{\overset{\sim}{y}}_{in} \cdot {\overset{\sim}{y}}_{i\; 1}} & {{\overset{\sim}{y}}_{in} \cdot {\overset{\sim}{y}}_{i\; 2}} & \; & \; & {{\overset{\sim}{y}}_{in} \cdot {\overset{\sim}{y}}_{i\; {n \cdot 1}}} & {\overset{\sim}{y}}_{in}^{2} \end{bmatrix}}} \\ {= \begin{bmatrix} \sigma_{i}^{2} & \sigma_{12}^{2} & \ldots & \ldots & \sigma_{{in} \cdot 1}^{2} & \sigma_{in}^{2} \\ \sigma_{2i}^{2} & \sigma_{2}^{2} & \ldots & \ldots & \sigma_{{2p} - 1}^{2} & \sigma_{2n}^{2} \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ \sigma_{n - 11}^{2} & \sigma_{n - 12}^{2} & \ldots & \ldots & \sigma_{n - 1}^{2} & \sigma_{n - {in}}^{2} \\ \sigma_{n\; 1}^{2} & \sigma_{n\; 2}^{2} & \ldots & \ldots & \sigma_{{nm} - 1}^{2} & \sigma_{n}^{2} \end{bmatrix}} \end{matrix} & (4) \end{matrix}$

where σ_(i) ² is the sample variance of ψ_(i) i=1, . . . ,n and σ_(ij) ² is the sample covariance of ψ_(i) and ψ_(j) i,j=1, . . . ,n.

Or,

$\overset{\sim}{S} = {\frac{1}{p - 1} \cdot {\overset{\sim}{Y}}^{1} \cdot \overset{\sim}{Y}}$

is the sample covariance matrix of {tilde over (ψ)} and is of dimension n×n. In CT Perfusion n is typically 40-60. A linear combination of ψ_(i), i=1, . . . ,n, ζ, can be defined as:

ζ=ã ^(T)·{tilde over (ψ)}

where ã is a given n×1 vector of coefficients. ζ is a random variable (not process) with observations z_(i) i=1, . . . ,p given by:

z _(i) =ã ^(T)·{tilde over (y)} _(i)

by definition of ζ. The sample mean of ζ, z, is given by:

$\overset{\_}{z} = {{\frac{1}{p} \cdot {\sum\limits_{i = 1}^{p}{\overset{\sim}{z}}_{i}}} = {{\frac{1}{p}{\sum\limits_{i = 1}^{p}{{\overset{\sim}{a}}^{T} \cdot {\overset{\sim}{y}}_{i}}}} = {{{\overset{\sim}{a}}^{T} \cdot \frac{1}{p} \cdot {\sum\limits_{i = 1}^{p}{\overset{\sim}{y}}_{i}}} = 0}}}$

Thus, ξ is also a zero mean random variable. The sample variance of ζ is given by:

$\begin{matrix} {{{sample}\mspace{14mu} {{var}(\zeta)}} = {\frac{1}{p - 1} \cdot {\sum\limits_{i = 1}^{p}\left( z_{i} \right)^{2}}}} \\ {= {\frac{1}{p - 1} \cdot {\sum\limits_{i = 1}^{p}{\left( {{\overset{\sim}{a}}^{T} \cdot {\overset{\sim}{y}}_{i}} \right) \cdot \left( {{\overset{\sim}{a}}^{T} \cdot {\overset{\sim}{y}}_{i}} \right)^{T}}}}} \\ {= {\frac{1}{p - 1} \cdot {\sum\limits_{i = 1}^{p}{{\overset{\sim}{a}}^{T} \cdot {\overset{\sim}{y}}_{i} \cdot {\overset{\sim}{y}}_{i}^{T} \cdot \overset{\sim}{a}}}}} \\ {= {{\frac{1}{p - 1} \cdot {\overset{\sim}{a}}^{T} \cdot \left( {\sum\limits_{i = 1}^{p}{\cdot {\overset{\sim}{y}}_{i} \cdot {\overset{\sim}{y}}_{i}^{T}}} \right) \cdot \overset{\sim}{a}} = {{\overset{\sim}{a}}^{T} \cdot \overset{\sim}{S} \cdot \overset{\sim}{a}}}} \end{matrix}$

Determination of the vector of coefficients, ã, to maximize the sample variance of ζ, ã^(T)·{tilde over (S)}·ã will now be investigated. Since ã^(T)·{tilde over (S)}·ã can be made as large as required by scaling ã with a constant, the optimization can only be done by imposing a normalization condition, such as ã^(T)·ã=1. To maximize ã^(T)·{tilde over (S)}·ã subject to ã^(T)·ã=1, the standard approach is to use the technique of Lagrange multipliers. That is it is sought to maximize:

ã ^(T) ·{tilde over (S)}·ã−λ·(ã ^(T) ·ã−1)

where λ is the Lagrange multiplier. Differentiation with respect to ã gives:

{tilde over (S)}·ã−λ·ã{tilde over (0)}

Thus, λ is the eigenvalue of {tilde over (S)} and ã is the corresponding eigenvector and

sample var(ζ)=ã ^(T) ·{tilde over (S)}·ã=ã ^(T) ·λ·ã=λ, the eigenvalue of {tilde over (S)}

That is to maximize ã^(T)·{tilde over (S)}·ã subject to ã^(T)·ã=1, ã is the eigenvector of {tilde over (S)} that has the highest eigenvalue.

Let λ₁ be the largest eigenvalue with the corresponding eigenvector ã₁, then ζ₁=ã₁ ^(T)·{tilde over (ψ)} is called the first sample principal component of {tilde over (ψ)}. it Is a random variable with observations defined by z_(i1)=ã₁ ^(T)·{tilde over (y)}_(i)z_(i1) is also called the score of the i^(th) observation on the first principal component. The second principal component, ζ₂=ã₂ ^(T)·{tilde over (ψ)}, similarly, maximizes the sample variance of ζ₂, ã₂ ^(T)·{tilde over (S)}·ã₂, subject to being uncorrected to ζ₁ and the normalization condition ã₂ ^(T)·ã₂=1. The observations corresponding to ζ₂ is z_(i2)=ã₂ ^(T)·{tilde over (y)}_(i). The sample covariance of ζ₁ and ζ₂ is:

$\begin{matrix} {{{sample}\mspace{14mu} {{cov}\left( {\zeta_{1},\zeta_{2}} \right)}} = {\frac{1}{p - 1} \cdot {\sum\limits_{i = 1}^{p}{z_{i\; 1} \cdot z_{i_{2}}}}}} \\ {= {\frac{1}{p - 1} \cdot {\sum\limits_{i = 1}^{p}{\left( {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{i}} \right) \cdot \left( {{\overset{\sim}{a}}_{2}^{T} \cdot {\overset{\sim}{y}}_{i}} \right)^{T}}}}} \\ {= {\frac{1}{p - 1} \cdot {\sum\limits_{i = 1}^{p}{{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{i} \cdot {\overset{\sim}{y}}_{i}^{T} \cdot {\overset{\sim}{a}}_{2}}}}} \\ {= {{\frac{1}{p - 1} \cdot {\overset{\sim}{a}}_{1}^{T} \cdot \left( {\sum\limits_{i = 1}^{p}{{\cdot {\overset{\sim}{y}}_{i} \cdot {\overset{\sim}{y}}_{i}^{T}}}} \right) \cdot {\overset{\sim}{a}}_{2}} = {{\overset{\sim}{a}}_{1}^{T} \cdot \overset{\sim}{S} \cdot {\overset{\sim}{a}}_{2}}}} \\ {= {{\frac{1}{p - 1} \cdot {\sum\limits_{i = 1}^{p}{\left( {{\overset{\sim}{a}}_{2}^{T} \cdot {\overset{\sim}{y}}_{i}} \right) \cdot \left( {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{i}} \right)^{T}}}} = {{\overset{\sim}{a}}_{2}^{T} \cdot \overset{\sim}{S} \cdot {\overset{\sim}{a}}_{1}}}} \end{matrix}$

The requirement that ζ₂ is uncorrelated to ζ₁ is the same as requiring:

ã ₂ ^(T) ·{tilde over (S)}·ã ₁ =ã ₂ ^(T)·λ₁ ·ã ₁=λ₁ ·[ã ₂ ^(T) ·ã ₁]=0

ã ₂ ^(T) ·{tilde over (S)}·ã ₁=0 and ã ₂ ^(T) ·ã ₁=0

ã ₁ ^(T) ·{tilde over (S)}·ã ₂=({tilde over (S)}·ã ₁)^(T) ·ã ₂=λ₁·[ã ₁ ^(T) ·ã ₂]=0

ã ₁ ^(T) ·{tilde over (S)}·ã ₂=0 and ã ₁ ^(T) ·ã ₂=0

Thus, any of the conditions:

ã ₂ ^(T) ·{tilde over (S)}·ã ₁=0 ã ₂ ^(T) ·ã ₁=0

ã ₁ ^(T) ·{tilde over (S)}·ã ₂=0 ã ₁ ^(T) ·ã ₂=0

can be used to specify that ζ₂ is uncorrected to ζ₁.

To maximize the sample variance of ζ₂, ã₂ ^(T)·{tilde over (S)}·ã₂, subject to the conditions that ζ₂ is uncorrelated ζ_(1 and ã) ₂ ^(T)·ã=1 is the same as to maximize:

ã ₂ ^(T) ·{tilde over (S)}·ã ₂−λ₂·(ã ₂ ^(T) ·ã ₂−1)−φã ₂ ^(T) ·ã ₁

where the condition ã₂ ^(T)·ã₁=0 is used to specify that ζ₂ is uncorrelated to ζ₁ and ζ₂ and φ are Lagrange multipliers. Differentiation with respect to ã₂ gives:

{tilde over (S)}·ã ₂−λ_(2·) ã ₂−φ·ã ₁=0

Multiplying through by ã₁ ^(T) gives:

ã ₁ ^(T) ·{tilde over (S)}·ã ₂−λ₂ ·ã ₁ ^(T) ·ã ₂−φ·ã ₁ ^(T) ·ã ₁=0

which, since the first two terms are zero and ã₁ ^(T)·ã₁=1, reduces to φ=0.

Therefore,

{tilde over (S)}·ã ₂−λ₂ ·ã ₂=0

so λ₂ is once more an eigenvalue of {tilde over (S)}, and ã₂ the corresponding eigenvector.

Again, ã₂ ^(T)·{tilde over (S)}·ã₂=λ₂ or the the sample variance of ζ₂ is λ₂. Assuming that {tilde over (S)} does not have repeat eigenvalues, λ₂ cannot be equal to λ₁. If it did, It follows that ã₂=ã₁. violating the constraint that ã₂ ^(T)·ã₁=0. Hence λ₂ is the second largest eigenvalue and ã₂ the corresponding eigenvector.

It can be shown using the same technique that for the third, fourth, . . . , n^(th) sample principal components, the vectors of coefficients ã₃, ã₄, . . . , ã_(n) are the eigenvectors of {tilde over (S)} corresponding to λ₃, λ₄, . . . , λ_(n), the third, fourth largest, and the smallest eigenvalue. Furthermore, the sample variances of the principal components are also given by the eigenvalues of {tilde over (S)}.

Define {tilde over (Z)} to be the p×n matrix of the scores of observations on principal components. In this case, the i^(th) row consists of the scores of the i^(th) observation of {tilde over (ψ)} (i.e. {tilde over (y)}_(i)) on all principal components ζ₁, ζ₂, . . . , ζ_(n−1), ζ_(n), that is:

$\begin{matrix} \begin{matrix} {\overset{\sim}{Z} = \begin{bmatrix} {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{1}} & \ldots & {{\overset{\sim}{a}}_{j}^{T} \cdot {\overset{\sim}{y}}_{1}} & \ldots & {{\overset{\sim}{a}}_{n}^{T} \cdot {\overset{\sim}{y}}_{1}} \\ \vdots & \ddots & \vdots & \ddots & \vdots \\ {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{i}} & \ldots & {{\overset{\sim}{a}}_{j}^{T} \cdot {\overset{\sim}{y}}_{i}} & \ldots & {{\overset{\sim}{a}}_{n}^{T} \cdot {\overset{\sim}{y}}_{i}} \\ \vdots & \ddots & \vdots & \ddots & \vdots \\ {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{p}} & \ldots & {{\overset{\sim}{a}}_{j}^{T} \cdot {\overset{\sim}{y}}_{p}} & \ldots & {{\overset{\sim}{a}}_{n}^{T} \cdot {\overset{\sim}{y}}_{p}} \end{bmatrix}} \\ {= \begin{bmatrix} {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{1}} & \ldots & {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{i}} & \ldots & {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{p}} \\ \vdots & \ddots & \vdots & \ddots & \vdots \\ {{\overset{\sim}{a}}_{1}^{T} \cdot {\overset{\sim}{y}}_{1}} & \ldots & {{\overset{\sim}{a}}_{j}^{T} \cdot {\overset{\sim}{y}}_{i}} & \ldots & {{\overset{\sim}{a}}_{j}^{T} \cdot {\overset{\sim}{y}}_{p}} \\ \vdots & \ddots & \vdots & \ddots & \vdots \\ {{\overset{\sim}{a}}_{n}^{T} \cdot {\overset{\sim}{y}}_{1}} & \ldots & {{\overset{\sim}{a}}_{n}^{T} \cdot {\overset{\sim}{y}}_{i}} & \ldots & {{\overset{\sim}{a}}_{n}^{T} \cdot {\overset{\sim}{y}}_{p}} \end{bmatrix}^{T}} \\ {= \left( {\begin{bmatrix} {\overset{\sim}{a}}_{1}^{T} \\ \; \\ {\overset{\sim}{a}}_{j}^{T} \\ \; \\ {\overset{\sim}{a}}_{n}^{T} \end{bmatrix} \cdot \begin{bmatrix} {\overset{\sim}{y}}_{1} & \ldots & {\overset{\sim}{y}}_{i} & \ldots & {\overset{\sim}{y}}_{p} \end{bmatrix}} \right)^{T}} \\ {{= \begin{bmatrix} {\overset{\sim}{y}}_{1}^{T} & \ldots & {\overset{\sim}{y}}_{i}^{T} & \ldots & {\overset{\sim}{y}}_{p_{p}}^{T} \end{bmatrix}^{T}}{\cdot \begin{bmatrix} {\overset{\sim}{a}}_{1} & \ldots & {\overset{\sim}{a}}_{j} & \ldots & {\overset{\sim}{a}}_{n} \end{bmatrix}}} \\ {= {\overset{\sim}{Y} \cdot \overset{\sim}{A}}} \end{matrix} & \left( {4a} \right) \end{matrix}$

where Ã is a n×n matrix whose columns are the eigenvectors of {tilde over (S)} and is orthogonal.

The first principal component, ζ₁, maximized is expressed by;

$\begin{matrix} {{{\overset{\sim}{a}}_{1}^{T} \cdot \overset{\sim}{S} \cdot {\overset{\sim}{a}}_{1}} = {\frac{1}{p - 1} \cdot {\overset{\sim}{a}}_{1}^{T} \cdot \left( {\sum\limits_{i = 1}^{p}{\cdot {\overset{\sim}{y}}_{i} \cdot {\overset{\sim}{y}}_{i}^{T}}} \right) \cdot {\overset{\sim}{a}}_{1}}} \\ {= {\frac{1}{p - 1} \cdot {\overset{\sim}{a}}_{1}^{T} \cdot \left( {\sum\limits_{i = 1}^{p}{\left( {{\overset{\sim}{x}}_{i} - \overset{\_}{x}} \right) \cdot \left( {{\overset{\sim}{x}}_{i} - \overset{\_}{x}} \right)^{T}}} \right) \cdot {\overset{\sim}{a}}_{1}}} \end{matrix}$

({tilde over (x)}_(i)− x) is the deviation of the time vs. enhancement curve (TEC) from the i^(th) pixel (pixel block) from the mean of TECs from all pixels (pixel blocks). Thus, the eigenvectors; ã₁, ã₂, ã₃, ã₄, . . . , ã_(n) represent the first, second, third, fourth, . . . , and least dominant time vs. enhancement behaviour in the set of TECs from all pixels. The loadings of the eigenvectors ã₁, ã₂, ã₃, ã₄, . . . ,ã_(n) in the TEC from the i^(th) pixel (pixel block) are:

ã ₁ ^(T) ·{tilde over (y)} _(i) , ã ₂ ^(T) ·{tilde over (y)} _(i) , ã ₃ ^(T) ·{tilde over (y)} _(i) , ã ₄ ^(T) ·{tilde over (y)} _(i) , . . . , ã _(n) ^(T) ·{tilde over (y)} _(i)

and is the i^(th) row of the matrix {tilde over (Z)} while the loadings of the eigenvector ã₁ in the TECs from all pixels (pixel blocks) are:

ã _(i) ^(T) ·{tilde over (y)} ₁ , ã _(i) ^(T) ·{tilde over (y)} ₂ , ã _(i) ^(T) ·{tilde over (y)} ₃ , ã _(i) ^(T) ·{tilde over (y)} ₄ , . . . , ã _(i) ^(T) ·{tilde over (y)} _(p)

and is the i^(th) column of the matrix {tilde over (Z)}. The i^(th) column of {tilde over (Z)}, therefore, gives the loading map of the eigenvector ã_(i) which corresponds to the i^(th) largest eigenvalue λ_(i).

To de-noise the dynamic Images from a CT Perfusion study, the reverse of the calculation of the loading maps of eigenvectors is required. Reconstituting a smooth version of the original dynamic images, {tilde over (Y)}({tilde over (X)}), from a truncated series of eigenvectors ã₁, ã₂, ã₃, ã₄, . . . ã_(r) is necessary.

As in Equation (1), the p×n matrix {tilde over (Y)} can be expanded by singular value decomposition as:

{tilde over (Y)}=Ũ·{tilde over (L)}·{tilde over (V)} ^(T)

where Ũ is a p×p orthogonal matrix, {tilde over (V)} is a n×n orthogonal matrix, and {tilde over (L)} is a p×n diagonal matrix with singular values of {tilde over (Y)} as its diagonal elements. Let l₁, . . . , l_(n) be the singular values of {tilde over (Y)} (it is assumed without loss of generality that {tilde over (Y)} is of full column rank, n and p>n). Using the singular value decomposition:

$\begin{matrix} {\overset{\sim}{S} = {\frac{1}{p - 1} \cdot {\overset{\sim}{Y}}^{T} \cdot \overset{\sim}{Y}}} \\ {= {\frac{1}{p - 1} \cdot \left( {\overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{V}}^{T}} \right)^{T} \cdot \overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{V}}^{T}}} \\ {= {\frac{1}{p - 1} \cdot \overset{\sim}{V} \cdot {\overset{\sim}{L}}^{T} \cdot {\overset{\sim}{U}}^{T} \cdot \overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{V}}^{T}}} \\ {= {\frac{1}{p - 1} \cdot \overset{\sim}{V} \cdot {\overset{\sim}{L}}^{T} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{V}}^{T}}} \end{matrix}$

Multiplying both sides of the equation by {tilde over (V)} yields:

$\begin{matrix} {{S \cdot V} = {\frac{1}{p - 1} \cdot \overset{\sim}{V} \cdot {\overset{\sim}{L}}^{T} \cdot \overset{\sim}{L}}} & (5) \end{matrix}$

{tilde over (L)}=└{tilde over (l)}_(i) . . . {tilde over (l)}_(i) . . . {tilde over (l)}_(n)┘ where {tilde over (l)}_(i) i=1, . . . , n is a p×1 vector whose elements are all zero except the i^(th) element which is equal to l_(i), that is {tilde over (l)}_(i) ^(T)=[0 . . . l_(i) . . . 0] and

${{\overset{\sim}{I}}_{i}^{T} \cdot {\overset{\sim}{I}}_{j}} = \left\{ \begin{matrix} I_{i}^{2} & {i = j} \\ 0 & {i \neq j} \end{matrix} \right.$

Then,

${{\overset{\sim}{L}}^{T} \cdot \overset{\sim}{L}} = {{\begin{bmatrix} {\overset{\sim}{I}}_{1}^{T} \\ \vdots \\ {\overset{\sim}{I}}_{i}^{T} \\ \vdots \\ {\overset{\sim}{I}}_{n}^{T} \end{bmatrix} \cdot \begin{bmatrix} {\overset{\sim}{I}}_{1}^{T} & \ldots & {\overset{\sim}{I}}_{i}^{T} & \ldots & {\overset{\sim}{I}}_{n}^{T} \end{bmatrix}} = \begin{bmatrix} {\overset{\sim}{m}}_{1}^{T} \\ \vdots \\ {\overset{\sim}{m}}_{i}^{T} \\ \vdots \\ {\overset{\sim}{m}}_{n}^{T} \end{bmatrix}}$

where {tilde over (m)}_(i) ^(T)=[0 . . . l_(i) ² . . . 0]. Let {tilde over (V)}=[{tilde over (v)}₁ . . . {tilde over (v)}_(i) . . . {tilde over (v)}_(n)] where {tilde over (v)}_(i) i=1, . . . ,n is a n×1 vector.

Then,

$\begin{matrix} {{\overset{\sim}{V} \cdot {\overset{\sim}{L}}^{T} \cdot \overset{\sim}{L}} = {\begin{bmatrix} {\overset{\sim}{v}}_{1} & \ldots & {\overset{\sim}{v}}_{i} & \ldots & {\overset{\sim}{v}}_{n} \end{bmatrix} \cdot \begin{bmatrix} {\overset{\sim}{m}}_{1}^{T} \\ \vdots \\ {\overset{\sim}{m}}_{i}^{T} \\ \vdots \\ {\overset{\sim}{m}}_{n}^{T} \end{bmatrix}}} \\ {= {\sum\limits_{i = 1}^{n}{{\overset{\sim}{v}}_{i} \cdot {\overset{\sim}{m}}_{1}^{T}}}} \\ {= {\sum\limits_{i = 1}^{n}{{\overset{\sim}{v}}_{i} \cdot \begin{bmatrix} 0 & \ldots & 1_{i}^{2} & \ldots & 0 \end{bmatrix}}}} \\ {= {\sum\limits_{i = 1}^{n}\begin{bmatrix} 0 & \ldots & {1_{i}^{2} \cdot {\overset{\sim}{v}}_{i}} & \ldots & 0 \end{bmatrix}}} \\ {= \begin{bmatrix} {1_{1}^{2} \cdot v_{1}} & \ldots & {1_{i}^{2} \cdot {\overset{\sim}{v}}_{i}} & \ldots & {1_{n}^{2} \cdot {\overset{\sim}{v}}_{n}} \end{bmatrix}} \end{matrix}$

Substituting in Equation (5) yields:

$\mspace{79mu} {{\overset{\sim}{S} \cdot \overset{\sim}{V}} = {{\frac{1}{p - 1} \cdot \overset{\sim}{V} \cdot {\overset{\sim}{L}}^{T} \cdot \overset{\sim}{L}} = {\left. \begin{bmatrix} \frac{1_{1}^{2} \cdot {\overset{\sim}{v}}_{1}}{p - 1} & \ldots & \frac{1_{i}^{2} \cdot {\overset{\sim}{v}}_{i}}{p - 1} & \ldots & \frac{1_{n}^{2} \cdot {\overset{\sim}{v}}_{n}}{p - 1} \end{bmatrix}\Rightarrow\begin{bmatrix} {\overset{\sim}{S} \cdot {\overset{\sim}{v}}_{1}} & \ldots & {\overset{\sim}{S} \cdot {\overset{\sim}{v}}_{i}} & \ldots & {\overset{\sim}{S} \cdot {\overset{\sim}{v}}_{n}} \end{bmatrix} \right. = {\quad{{\left. \begin{bmatrix} \frac{1_{1}^{2} \cdot {\overset{\sim}{v}}_{1}}{p - 1} & \ldots & \frac{1_{i}^{2} \cdot {\overset{\sim}{v}}_{i}}{p - 1} & \ldots & \frac{1_{n}^{2} \cdot {\overset{\sim}{v}}_{n}}{p - 1} \end{bmatrix}\mspace{20mu}\Rightarrow{\overset{\sim}{S} \cdot {\overset{\sim}{v}}_{i}} \right. = {{{\frac{1_{i}^{2}}{p - 1} \cdot {\overset{\sim}{v}}_{i}}\mspace{31mu} i} = 1}},\ldots \mspace{14mu},n}}}}}$

From the discussion on eigenvectors and eigenvalues;

${\overset{\sim}{v}}_{i} = {\left. {\overset{\sim}{a}}_{i}\Rightarrow\overset{\sim}{V} \right. = \overset{\sim}{A}}$ $\frac{1_{i}^{2}}{p - 1} = \lambda_{i}$

or the singular values of {tilde over (Y)}(l_(i)) is equal to the square root of (p−1) times the eigenvalue value of {tilde over (S)}(λ_(i)), where

${\overset{\sim}{S} = {\frac{1}{p} \cdot {\overset{\sim}{Y}}^{T} \cdot \overset{\sim}{Y}}},$

i.e. l_(i)=√{square root over ((p−1)·λ_(i))}

Thus, {tilde over (Y)}^(T) ·{tilde over (Y)}·{tilde over (v)} _(i) =l _(i) ² ·{tilde over (v)} _(i) or {tilde over (Y)} ^(T) ·{tilde over (Y)}·ã _(i) =l _(i) ² ·ã _(i) i=1, . . . ,n   (5a)

Next, consider

$\begin{matrix} \begin{matrix} {{\overset{\sim}{S}}^{*} = {{\frac{1}{p - 1} \cdot \overset{\sim}{Y} \cdot {\overset{\sim}{Y}}^{T}} = {\frac{1}{p - 1} \cdot \overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{V}}^{T} \cdot \left( {\overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{V}}^{T}} \right)^{T}}}} \\ {= {\frac{1}{p - 1} \cdot \overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{V}}^{T} \cdot \overset{\sim}{V} \cdot {\overset{\sim}{L}}^{T} \cdot {\overset{\sim}{U}}^{T}}} \\ {= {\frac{1}{p - 1} \cdot \overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{L}}^{T} \cdot {\overset{\sim}{U}}^{T}}} \end{matrix} & (6) \end{matrix}$

(note that {tilde over (S)}* is not the transpose of {tilde over (S)})

Multiplying both sides of the equation by Ũ yields:

${{\overset{\sim}{S}}^{*}\overset{\sim}{U}} = {\frac{1}{p - 1} \cdot \overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{L}}^{T}}$ ${\overset{\sim}{L} \cdot {\overset{\sim}{L}}^{T}} = {{\begin{bmatrix} {\overset{\sim}{I}}_{1} & \ldots & {\overset{\sim}{I}}_{i} & \ldots & {\overset{\sim}{I}}_{n} \end{bmatrix} \cdot \begin{bmatrix} {\overset{\sim}{I}}_{1}^{T} \\ \vdots \\ {\overset{\sim}{I}}_{i}^{T} \\ \vdots \\ {\overset{\sim}{I}}_{n}^{T} \end{bmatrix}} = {\sum\limits_{i = 1}^{n}{{\overset{\sim}{I}}_{i} \cdot {\overset{\sim}{I}}_{i}^{T}}}}$ $\begin{matrix} {{{\overset{\sim}{I}}_{i} \cdot {\overset{\sim}{I}}_{i}^{T}} = {\underset{\underset{p \times 1}{}}{\begin{bmatrix} 0_{1} \\ \vdots \\ 1_{i} \\ \vdots \\ 0_{p} \end{bmatrix}} \cdot \underset{\underset{1 \times p}{}}{\begin{bmatrix} 0_{1} & \ldots & 1_{i} & \ldots & 0_{p} \end{bmatrix}}}} \\ {= \begin{bmatrix} 0 & \ldots & 0_{i} & \ldots & 0_{1\; n} & \ldots & 0_{1\; p} \\ \vdots & \ddots & \vdots & \ddots & \vdots & \ddots & \vdots \\ 0_{i\; 1} & \ldots & 1_{i}^{2} & \ldots & 0_{i\; n} & \ldots & 0_{ip} \\ \vdots & \ddots & \vdots & \ddots & \vdots & \ddots & \vdots \\ 0_{n\; 1} & \ldots & 0_{ni} & \ldots & 0_{nn} & \ldots & 0_{np} \\ \vdots & \ddots & \vdots & \ddots & \vdots & \ddots & \vdots \\ 0_{p\; 1} & \ldots & 0_{pi} & \ldots & 0_{pn} & \ldots & 0_{pp} \end{bmatrix}} \end{matrix}$ ${{\overset{\sim}{I}}_{i} \cdot {\overset{\sim}{I}}_{j}^{T}} = {{\underset{\underset{p \times 1}{}}{\begin{bmatrix} 0_{1} \\ \vdots \\ 1_{i} \\ \vdots \\ 0_{j} \\ \vdots \\ 0_{p} \end{bmatrix}} \cdot \underset{\underset{1 \times p}{}}{\begin{bmatrix} 0_{1} & \ldots & 0_{i} & \ldots & 1_{j} & \ldots & 0_{p} \end{bmatrix}}} = {\overset{\sim}{0}}_{p \times p}}$

Thus,

${\overset{\sim}{L} \cdot {\overset{\sim}{L}}^{T}} = {\begin{bmatrix} 1_{1}^{2} & \ldots & 0_{i} & \ldots & 0_{1\; n} & \ldots & 0_{1\; p} \\ \vdots & \ddots & \vdots & \ddots & \vdots & \ddots & \vdots \\ 0_{n} & \ldots & 1_{i}^{2} & \ldots & 0_{i\; n} & \ldots & 0_{ip} \\ \vdots & \ddots & \vdots & \ddots & \vdots & \ddots & \vdots \\ 0_{n\; 1} & \ldots & 0_{ni} & \ldots & 1_{n}^{2} & \ldots & 0_{np} \\ \vdots & \ddots & \vdots & \ddots & \vdots & \ddots & \vdots \\ 0_{p\; 1} & \ldots & 0_{pi} & \ldots & 0_{pn} & \ldots & 0_{pp} \end{bmatrix} = \begin{bmatrix} {\overset{\sim}{m}}_{1}^{*T} \\ \vdots \\ {\overset{\sim}{m}}_{i}^{*T} \\ \vdots \\ {\overset{\sim}{m}}_{n}^{*T} \\ \vdots \\ 0 \end{bmatrix}}$

Let {tilde over (m)}_(i)*=[0 . . . l_(i) ² . . . 0_(p)]^(T) be a p×1 vector as defined, then

${\overset{\sim}{L} \cdot {\overset{\sim}{L}}^{T}} = \begin{bmatrix} {\overset{\sim}{m}}_{1}^{*T} \\ \vdots \\ {\overset{\sim}{m}}_{i}^{*T} \\ \vdots \\ {\overset{\sim}{m}}_{n}^{*T} \\ 0_{n + 1} \\ \vdots \\ 0_{p} \end{bmatrix}$

Let Ũ=[ũ₁ . . . ũ_(i) . . . ũ_(p)] where ũ_(i) i=1, . . . ,p is a p×1 vector.

Then,

$\begin{matrix} {{\overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{L}}^{T}} = {\begin{bmatrix} {\overset{\sim}{u}}_{1} & \ldots & {\overset{\sim}{u}}_{i} & \ldots & {\overset{\sim}{u}}_{n} & {\overset{\sim}{u}}_{n + 1} & \ldots & {\overset{\sim}{u}}_{p} \end{bmatrix} \cdot \begin{bmatrix} {\overset{\sim}{m}}_{1}^{*T} \\ \vdots \\ {\overset{\sim}{m}}_{l}^{*T} \\ \vdots \\ {\overset{\sim}{m}}_{n}^{*T} \\ 0_{n + 1} \\ \vdots \\ 0_{p} \end{bmatrix}}} \\ {= {\sum\limits_{i = 1}^{n}{{{\overset{\sim}{u}}_{i} \cdot {\overset{\sim}{m}}_{i}^{T}}I}}} \\ {= {{\sum\limits_{i = 1}^{n}{{\overset{\sim}{u}}_{i} \cdot \begin{bmatrix} 0 & \ldots & 1_{i}^{2} & \ldots & 0_{p} \end{bmatrix}}} +}} \\ {{\sum\limits_{i = {n + 1}}^{n}{{\overset{\sim}{u}}_{i} \cdot \begin{bmatrix} 0 & \ldots & 0_{i} & \ldots & 0_{p} \end{bmatrix}}}} \\ {= {\sum\limits_{i = 1}^{n}\begin{bmatrix} 0 & \ldots & {1_{i}^{2} \cdot {\overset{\sim}{u}}_{i}} & \ldots & 0_{p} \end{bmatrix}}} \\ {= \begin{bmatrix} {1_{1}^{2} \cdot {\overset{\sim}{u}}_{1}} & \ldots & {1_{i}^{2} \cdot {\overset{\sim}{u}}_{i}} & \ldots & {1_{n}^{2} \cdot {\overset{\sim}{u}}_{i}} & 0_{\overset{\sim}{n} + 1} & \ldots & 0_{p} \end{bmatrix}} \end{matrix}$

Substituting in Equation (6) yields;

$\mspace{20mu} {\left. \begin{matrix} {{{\overset{\sim}{S}}^{*} \cdot \overset{\sim}{U}} = {\frac{1}{p - 1} \cdot \overset{\sim}{U} \cdot \overset{\sim}{L} \cdot {\overset{\sim}{L}}^{T}}} \\ {= \begin{bmatrix} \frac{1_{1}^{2} \cdot {\overset{\sim}{u}}_{1}}{p - 1} & \ldots & \frac{1_{i}^{2} \cdot {\overset{\sim}{u}}_{i}}{p - 1} & \ldots & \frac{1_{n}^{2} \cdot {\overset{\sim}{u}}_{n}}{p - 1} & 0_{n + 1} & \ldots & 0_{p} \end{bmatrix}} \end{matrix}\Rightarrow\begin{bmatrix} {{\overset{\sim}{S}}^{*} \cdot {\overset{\sim}{u}}_{1}} & \ldots & {{\overset{\sim}{S}}^{*} \cdot {\overset{\sim}{u}}_{i}} & \ldots & {{\overset{\sim}{S}}^{*} \cdot {\overset{\sim}{u}}_{n}} & 0_{n + 1} & \ldots & 0_{p} \end{bmatrix} \right. = {\quad\left\lbrack {\left. \begin{matrix} \frac{1_{1}^{2} \cdot {\overset{\sim}{u}}_{1}}{p - 1} & \ldots & \frac{1_{i}^{2} \cdot {\overset{\sim}{u}}_{i}}{p - 1} & \ldots & \frac{1_{n}^{2} \cdot u_{n}}{p - 1} & 0_{n + 1} & \ldots & 0_{p} \end{matrix}\mspace{20mu}\Rightarrow{{\overset{\sim}{S}}^{*} \cdot {\overset{\sim}{u}}_{i}} \right. = \left\{ \begin{matrix} {\frac{1_{i}^{2}}{p - 1} \cdot {\overset{\sim}{u}}_{i}} & {i \leq n} \\ {0 \cdot {\overset{\sim}{u}}_{i}} & {{n + 1} \leq i \leq p} \end{matrix} \right.} \right.}}$

Thus, ũ_(i) i=1, . . . ,n is the eigenvector of {tilde over (S)}* corresponding to the i^(th) eigenvalue

$\frac{1_{i}^{2}}{p - 1}$

which happens also to be the i^(th) eigenvalue of {tilde over (S)}, while all ũ_(i) i=n+1, . . . ,p are eigenvectors of {tilde over (S)}* with zero eigenvalue. Also

{tilde over (Y)}·{tilde over (Y)} ^(T) ·ũ _(i) =l _(i) ² ·ũ _(i) i=1, . . . ,n   (6a)

As stated above, Equation (5a) is:

{tilde over (Y)} ^(T) ·{tilde over (Y)}·{tilde over (v)} _(i) =l _(i) ² ·{tilde over (v)} _(i)

Multiplying both sides by {tilde over (Y)} yields:

{tilde over (Y)}·{tilde over (Y)} ^(T) ·{tilde over (Y)}·{tilde over (v)} _(i) l _(i) ² ·{tilde over (Y)}·{tilde over (v)} _(i)

Comparing with Equation (6a):

{tilde over (Y)}·{tilde over (v)} _(i) =c·ũ _(i) where c is a constant   (7a)

Similarly multiplying both sides of Equation (6a) by {tilde over (Y)}^(T) yields;

{tilde over (Y)} ^(T) ·{tilde over (Y)}·{tilde over (Y)} ^(T) ·ũ _(i) =l _(i) ² ·{tilde over (Y)} ^(T) ·ũ _(i)

Comparing with Equation (5a):

{tilde over (Y)} ^(T) ·ũ _(i) =c*·{tilde over (v)} _(i) where c is a constant (7b)

From Equation (7b):

${{\overset{\sim}{v}}_{i} = \frac{1}{c^{*}}}{\cdot {\overset{\sim}{Y}}^{T} \cdot {\overset{\sim}{u}}_{i}}$

Substituting into Equation (7a) yields:

{tilde over (Y)}·{tilde over (Y)} ^(T) ·ũ _(i) =c·c·ũ _(i)

Substituting into Equation (6a) yields:

l _(i) ² ·ũ _(i) =c*·c·ũ _(i)

Therefore, c*·c=l_(i) ² Without loss of generality, c* is set to:

c*=c=1_(i)=√{square root over ((p−1)·λ_(i))}i=1, . . .n and n−p

Thus, for the singular value decomposition of {tilde over (Y)}:

{tilde over (Y)}=Ũ·{tilde over (L)}·{tilde over (V)} ^(T)

where Ũ is a p×p orthogonal matrix;

Ũ=[ũ _(l) . . . ũ _(i) . . . ũ _(p)] and ũ _(i) i=1, . . . ,p is a p×1 vector;

{tilde over (V)} is a n×n orthogonal matrix:

{tilde over (V)}=[{tilde over (v)} _(l) . . . {tilde over (v)} _(i) . . . {tilde over (v)}_(n)] and {tilde over (v)} _(i) i=1, . . . ,n is a n×1 vector;

and {tilde over (L)} is a p×n diagonal matrix with singular values of {tilde over (Y)}, l_(i), . . . ,l_(n), as its diagonal elements; it Is also assumed without loss of generality that {tilde over (Y)} is of full column rank, n and p>n. It is shown that:

{tilde over (v)}_(i)=ã_(i) where ã_(i) is the i^(th) eigenvector of

$\overset{\sim}{S} = {\frac{1}{p - 1} \cdot {\overset{\sim}{Y}}^{T} \cdot \overset{\sim}{Y}}$

corresponding to the eigenvalue

$\frac{1_{i}^{2}}{\left( {p - 1} \right)};$

and from Equation (7c)

${\overset{\sim}{u}}_{i} = {{\frac{1}{c}{\overset{\sim}{Y} \cdot {\overset{\sim}{v}}_{i}}} = {\frac{1}{\sqrt{\left( {p - 1} \right) \cdot \lambda_{i}}} \cdot \overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{i}}}$

As discussed above, to de-noise {tilde over (Y)} the SVD expansion can be truncated after the r^(th) singular value:

$\begin{matrix} \left. \begin{matrix} {\overset{\sim}{Y} \approx {\sum\limits_{i = 1}^{r}{1_{i} \cdot {\overset{\sim}{u}}_{i} \cdot {\overset{\sim}{v}}_{i}^{T}}}} \\ {= {\sum\limits_{i = 1}^{r}{1_{i} \cdot {\overset{\sim}{u}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}} \\ {= {\sum\limits_{i = 1}^{r}{1_{i} \cdot \frac{1}{\sqrt{\left( {p - 1} \right) \cdot \lambda_{i}}} \cdot \overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}} \\ {= {\sum\limits_{i = 1}^{r}{\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}} \end{matrix}\Rightarrow{\overset{\sim}{Y} \approx {\overset{\sim}{Y} \cdot {\sum\limits_{i = 1}^{r}{{\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}}} \right. & (8) \end{matrix}$

Equation (8) also affords a very simple geometric interpretation as explained in the following.

$\begin{matrix} \begin{matrix} {\overset{\sim}{Y} \approx {\overset{\sim}{Y \cdot}{\sum\limits_{i = 1}^{r}{{\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}}} \\ {= {\sum\limits_{i = 1}^{r}{\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}} \\ {= {\begin{pmatrix} {\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{1}} & {\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{2}} & \ldots & {\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{r - 1}} & {\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{r}} \end{pmatrix} \cdot \begin{pmatrix} {\overset{\sim}{a}}_{1}^{T} \\ {\overset{\sim}{a}}_{2}^{T} \\ \vdots \\ {\overset{\sim}{a}}_{r - 1}^{T} \\ {\overset{\sim}{a}}_{r}^{T} \end{pmatrix}}} \\ {= {\overset{\sim}{Y} \cdot {\overset{\sim}{A}}_{r} \cdot {\overset{\sim}{A}}_{r}^{T}}} \end{matrix} & (9) \end{matrix}$

where Ã, is a n×r matrix whose i^(th) column is ã_(i) and from Equation (4a):

{tilde over (Z)} _(r) ={tilde over (Y)}·Ã _(r)

and the rows and columns of {tilde over (Z)}_(r) have the same interpretation as those of {tilde over (Z)}.

Rewrite Equation (9):

$\begin{matrix} \begin{matrix} {\overset{\sim}{Y} \approx {\overset{\sim}{Y \cdot}{\sum\limits_{i = 1}^{r}{{\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}}} \\ {= {\sum\limits_{i = 1}^{r}{\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}} \\ {= {\begin{pmatrix} {\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{1}} & {\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{2}} & \ldots & {\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{r - 1}} & {\overset{\sim}{Y} \cdot {\overset{\sim}{a}}_{r}} \end{pmatrix} \cdot \begin{pmatrix} {\overset{\sim}{a}}_{1}^{T} \\ {\overset{\sim}{a}}_{2}^{T} \\ \vdots \\ {\overset{\sim}{a}}_{r - 1}^{T} \\ {\overset{\sim}{a}}_{r}^{T} \end{pmatrix}}} \\ {= {\begin{pmatrix} {\begin{pmatrix} {\overset{\sim}{y}}_{1}^{T} \\ {\overset{\sim}{y}}_{2}^{T} \\ \vdots \\ {\overset{\sim}{y}}_{p - 1}^{T} \\ {\overset{\sim}{y}}_{p}^{T} \end{pmatrix} \cdot {\overset{\sim}{a}}_{1}} & {\begin{pmatrix} {\overset{\sim}{y}}_{1}^{T} \\ {\overset{\sim}{y}}_{2}^{T} \\ \vdots \\ {\overset{\sim}{y}}_{p - 1}^{T} \\ {\overset{\sim}{y}}_{p}^{T} \end{pmatrix} \cdot {\overset{\sim}{a}}_{2}} & \ldots & {\begin{pmatrix} {\overset{\sim}{y}}_{1}^{T} \\ {\overset{\sim}{y}}_{2}^{T} \\ \vdots \\ {\overset{\sim}{y}}_{p - 1}^{T} \\ {\overset{\sim}{y}}_{p}^{T} \end{pmatrix} \cdot {\overset{\sim}{a}}_{r - 1}} & {\begin{pmatrix} {\overset{\sim}{y}}_{1}^{T} \\ {\overset{\sim}{y}}_{2}^{T} \\ \vdots \\ {\overset{\sim}{y}}_{p - 1}^{T} \\ {\overset{\sim}{y}}_{p}^{T} \end{pmatrix} \cdot {\overset{\sim}{a}}_{r}} \end{pmatrix} \cdot}} \\ {\begin{pmatrix} {\overset{\sim}{a}}_{1}^{T} \\ {\overset{\sim}{a}}_{2}^{T} \\ \vdots \\ {\overset{\sim}{a}}_{r - 1}^{T} \\ {\overset{\sim}{a}}_{r}^{T} \end{pmatrix}} \\ {= {\begin{pmatrix} {{\overset{\sim}{y}}_{1}^{T} \cdot {\overset{\sim}{a}}_{1}} & {{\overset{\sim}{y}}_{1}^{T} \cdot {\overset{\sim}{a}}_{2}} & \ldots & {{\overset{\sim}{y}}_{1}^{T} \cdot {\overset{\sim}{a}}_{r - 1}} & {{\overset{\sim}{y}}_{1}^{T} \cdot {\overset{\sim}{a}}_{r}} \\ {{\overset{\sim}{y}}_{2}^{T} \cdot {\overset{\sim}{a}}_{1}} & {{\overset{\sim}{y}}_{2}^{T} \cdot {\overset{\sim}{a}}_{2}} & \ldots & {{\overset{\sim}{y}}_{2}^{T} \cdot {\overset{\sim}{a}}_{r - 1}} & {{\overset{\sim}{y}}_{2}^{T} \cdot {\overset{\sim}{a}}_{r}} \\ \vdots & \vdots & \ldots & \vdots & \vdots \\ {{\overset{\sim}{y}}_{p - 1}^{T} \cdot {\overset{\sim}{a}}_{1}} & {{\overset{\sim}{y}}_{p - 1}^{T} \cdot {\overset{\sim}{a}}_{2}} & \ldots & {{\overset{\sim}{y}}_{p - 1}^{T} \cdot {\overset{\sim}{a}}_{r - 1}} & {{\overset{\sim}{y}}_{p - 1}^{T} \cdot {\overset{\sim}{a}}_{r}} \\ {{\overset{\sim}{y}}_{p}^{T} \cdot {\overset{\sim}{a}}_{1}} & {{\overset{\sim}{y}}_{n}^{T} \cdot {\overset{\sim}{a}}_{2}} & \ldots & {{\overset{\sim}{y}}_{p}^{T} \cdot {\overset{\sim}{a}}_{r - 1}} & {{\overset{\sim}{y}}_{p}^{T} \cdot {\overset{\sim}{a}}_{r}} \end{pmatrix} \cdot \begin{pmatrix} {\overset{\sim}{a}}_{1}^{T} \\ {\overset{\sim}{a}}_{2}^{T} \\ \vdots \\ {\overset{\sim}{a}}_{r - 1}^{T} \\ {\overset{\sim}{a}}_{r}^{T} \end{pmatrix}}} \\ {= \begin{pmatrix} {\sum\limits_{i = 1}^{r}{\left( {{\overset{\sim}{y}}_{1}^{T} \cdot {\overset{\sim}{a}}_{i}} \right) \cdot {\overset{\sim}{a}}_{i}^{T}}} \\ {\sum\limits_{i = 1}^{r}{\left( {{\overset{\sim}{y}}_{2}^{T} \cdot {\overset{\sim}{a}}_{i}} \right) \cdot {\overset{\sim}{a}}_{i}^{T}}} \\ \vdots \\ {\sum\limits_{i = 1}^{r}{\left( {{\overset{\sim}{y}}_{p - 1}^{T} \cdot {\overset{\sim}{a}}_{i}} \right) \cdot {\overset{\sim}{a}}_{i}^{T}}} \\ {\sum\limits_{i = 1}^{r}{\left( {{\overset{\sim}{y}}_{p}^{T} \cdot {\overset{\sim}{a}}_{i}} \right) \cdot {\overset{\sim}{a}}_{i}^{T}}} \end{pmatrix}} \end{matrix} & (10) \end{matrix}$

Equation (10) suggests that the TEC for the i^(th) pixel (pixel block) is a weighted summation of r eigenvectors with the weights given by the loading of the i^(th) pixel TEC on the eigenvectors.

The eigenvectors ã₁, ã₂, . . . , ã_(r−1), ã_(r) can be regarded as forming an orthonormal basis in n dimensional space. The projection of {tilde over (y)}_(i) on ã_(i) is {tilde over (y)}_(i) ^(T)·ã_(i) and {tilde over (y)}_(i) can be reconstituted as

$\sum\limits_{j = 1}^{r}{\left( {{\overset{\sim}{y}}_{i}^{T} \cdot {\overset{\sim}{a}}_{j}} \right) \cdot {{\overset{\sim}{a}}_{j}^{T}.}}$

The alogorithm to de-noise {tilde over (X)}=[{tilde over (x)}_(i) ^(T) . . . {tilde over (x)}_(i) ^(T) . . . {tilde over (x)}x _(p) ^(T)] is as follows:

1. Calculate the p×n zero mean matrix, {tilde over (Y)}=[{tilde over (y)}₁ ^(T) . . . {tilde over (y)}_(i) ^(T) . . . {tilde over (y)}_(p) ^(T)]^(T), corresponding to {tilde over (X)}, where

{tilde over (y)} _(i) ={tilde over (x)} _(i) − x and

$\overset{\_}{x} = {\frac{1}{p} \cdot {\sum\limits_{i = 1}^{p}{\overset{\sim}{x}}_{i}}}$

2. Calculate the n×n sample covariance matrix, {tilde over (S)}:

$\overset{\sim}{S} = {\frac{1}{p - 1} \cdot {\overset{\sim}{Y}}^{T} \cdot \overset{\sim}{Y}}$

3. Calculate the n pairs of eigenvalue and eigenvectors,

(λ_(i) ,ã _(i))i=1, . . . ,n

4. Calculate the n×n smoothing matrix by keeping only the largest r eigenvalues:

$\sum\limits_{i = 1}^{r}{{\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}$

5. Smooth {tilde over (Y)}=[{tilde over (y)}_(i)* . . . {tilde over (y)}_(i)* . . . {tilde over (y)}_(p)] by calculating the product:

${\overset{\sim}{Y}}^{*} = {\begin{bmatrix} {\overset{\sim}{y}}_{1}^{*} & \ldots & {\overset{\sim}{y}}_{i}^{*} & \ldots & {\overset{\sim}{y}}_{p}^{*} \end{bmatrix} \approx {\overset{\sim}{Y} \cdot {\sum\limits_{i = 1}^{r}{{\overset{\sim}{a}}_{i} \cdot {\overset{\sim}{a}}_{i}^{T}}}}}$

6. Calculate a smoothed version of {tilde over (X)}* as follows:

{tilde over (X)}* =[{tilde over (y)} ₁ *+ x . . . {tilde over (y)} _(i) *+ x . . . {tilde over (y)} _(p) *+ x],

An example of the method described herein will now be demonstrated with regard to experimental results. The principal component analysis (PCA) described herein is tested for the ability to achieve dose reduction of CT scans.

The PCA method will now be summarized based on a CT Perfusion study that generates a plurality of time separated images that capture the passage of contrast through the brain. Corresponding to each pixel in the series of images, a curve is generated that represents the contrast concentration in that pixel as a function of time. A difference curve, equal to the difference of the curve from the mean of all pixel curves is also generated. A covariance matrix of the co-variations of all pairs of difference curves is calculated and represents all possible variations about the mean curve. The principal component analysis method analyzes the covariance matrix to find common temporal patterns among the curves by finding linear combinations of the difference curves that represent most of the variations about the mean curve. It can be shown that such linear combinations, or principal components, are the eigenvectors of the covariance matrix and that the eigenvector with the largest eigenvalue is the most prominent temporal feature among all the difference curves, the eigenvector with the second largest eigenvalue is the second most prominent temporal feature and so on, while eigenvectors with small eigenvalues are from noise in the CT images. A corollary is that each difference curve can be represented as a sum of all the principal components and by discarding components with small eigenvalues, noise can be effectively suppressed. To denoise the time series of images, the mean curve is added to all the difference curves reconstituted by using the first few principal components with large eigenvalues.

While currently available statistical filters remove noise in projection data before image reconstruction, the principal component analysis method removes noise from the reconstructed images. Experimental results described below show that performing PCA leads to dose reduction in CT imaging.

The PCA method is tested versus the traditional filtered back-projection (FBP) method in radiation dose reduction for CT Perfusion applications. The dose saving of PCA versus FBP on measuring brain perfusion using CT Perfusion was tested in a healthy pig, which was scanned four times with the x-ray tube current changed from 190 mA to 100 mA; 75 mA and 50 mA. respectively, while keeping other scanning parameters the same.

FIG. 3 shows brain blood flow maps of the pig calculated using the J-W model with CT Perfusion images obtained using (A) 190 mA and FBP reconstruction; (B) 100 mA, FBP reconstruction and PCA; (C) 70 mA, FBP reconstruction and PCA; and, (D) 50 mA, FBP reconstruction and PCA. Blood flow map (E) of FIG. 3 shows regions of interest (3 outlined circles) used for calculation of Figure of Merit of the blood flow maps shown in FIG. 4. The regions are superimposed on a CT image which shows a coronal section through the brain of the pig. The dark areas are the skull and jaw bones.

FIG. 4 shows that in terms of standard deviation/mean of blood flow (Figure of Merit) in the three regions shown in FIG. 3(E): 70 mA with PCA was better than 190 mA with FBP, while 50 mA PCA was worse than 190 mA with FBP (p<0.05). The image qualify of the blood flow maps in FIG. 3 also reflects this progression. Therefore, the PCA method is able to reduce radiation dose required to obtain images in CT Perfusion studies and in maintaining the quality of derived blood flow maps compared to the use of FBP alone. More specifically, the PCA method achieved approximately three fold reduction in radiation dose compared to the use of FBP alone. The effect of the PCA method on dose reduction in production of BBB-PS maps was not demonstrated because the blood-brain barrier remained intact. However, since blood flow, blood volume and BBB-PS are calculated together in the J-W model, the dose reduction shown using blood flow maps is expected to apply to BBB-PS maps.

The principal component analysis methodology described herein has been implemented in a computer executable software application using C++. The time required to process ninety-five (95) 512×512 CT brain images is less than two (2) minutes on a general purpose computing device such as for example a personal computer (PC).

The method described herein can be implemented on hardware such as system 400 shown in FIG. 5. An input 510 receives a plurality of time separated images, which can be previously stored, received directly from an imaging device, or communicated over a wired or wireless communication link from a remote location. A general purpose computing device 505 receives the time separated images from the input and executes a software application thereby to process the time separated images as described above. The general purpose computing device 505 interfaces with the user through a display 520, a keyboard 515 and/or a mouse or other pointing device 525. Results, for example the constructed processed images, can be presented on display 520 and/or output to any suitable output device 530, for example, a printer, a storage device, or a communication device for communicating the results to a remote location.

The software application described herein may run as a stand-alone application or may be incorporated info other available applications to provide enhanced functionality to those applications. The software application may include program modules including routines, programs, object components, data structures etc. and may be embodied as computer readable program code stored on a computer readable medium. The computer readable medium is any data storage device that can store data, which can thereafter be read by a computer system. Examples of computer readable media include for example read-only memory, random-access memory, CD-ROMs, magnetic tape and optical data storage devices. The computer readable program code can also be distributed over a network including coupled computer systems so that the computer readable program code is stored and executed in a distributed fashion.

The above-described embodiments are intended to be examples and alterations and modifications may be effected thereto, by those of skill in the art, without departing from the scope of the invention which is defined by the claims appended hereto. 

1. A method of processing a plurality of time separated images comprising: selecting a plurality of imaging units in each image; determining a temporal difference for each imaging unit; and selecting temporal differences above a threshold limit.
 2. The method of claim 1, further comprising ranking each measured temporal difference prior to said selecting.
 3. The method of claim 1, further comprising constructing a processed image using the selected temporal differences.
 4. The method of claim 1, wherein each imaging unit is one of a pixel and a voxel.
 5. The method of claim 1, wherein each imaging unit is one of a plurality of pixels and a plurality of voxels.
 6. The method of claim 1, wherein the temporal difference is based on contrast enhancement.
 7. The method of claim 6, wherein the temporal difference is a difference of a contrast agent.
 8. The method of claim 7, wherein contrast enhancement is based on the concentration of the contrast agent.
 9. The method of claim 7, wherein contrast enhancement is based on the activation of the contrast agent.
 10. The method of claim 1, further composing characterizing the measured temporal differences with a blind signal separation statistical technique.
 11. The method of claim 1, wherein determining the temporal difference comprises calculating a covariance matrix of temporal differences for the imaging units.
 12. The method of claim 11, further comprising analyzing the covariance matrix with a blind signal separation statistical technique to determine common temporal patterns among the temporal differences.
 13. The method of claim 12, further comprising analyzing the eigenvectors of the covariance matrix.
 14. The method of claim 13, wherein eigenvalues of the eigenvector represent the degree of temporal difference.
 15. The method of claim 14, wherein the selecting of temporal differences comprises selecting eigenvalues above the threshold limit.
 16. The method of claim 1, wherein the threshold limit is adjustable.
 17. The method of claim 12, wherein the blind signal separation statistical technique is selected from the group consisting of principal component analysis, independent component analysis, blind source deconvolution, Karhunen-Loeve transform and Hotelling transform.
 18. The method of claim 1, wherein the plurality of time separated images are obtained using a dynamic medical imaging technique.
 19. The method of claim 18, wherein the dynamic medical imaging technique comprises use of a contrast agent.
 20. The method of claim 18, wherein the time separated images are obtained using a protocol having a reduced radiation dose.
 21. The method of claim 18, wherein the time separated Images are obtained using a protocol having a reduced amount of contrast agent.
 22. The method of claim 18, wherein the dynamic medical imaging technique is magnetic resonance imaging (MRI), functional MRI, positron emission tomograghy, nuclear medecine or computed tomography.
 23. The method of claim 18, wherein the dynamic medical imaging technique is computed tomography (CT).
 24. The method of claim 23, wherein the time separated images are obtained using a CT Perfusion protocol having a reduced radiation dose.
 25. The method of claim 23, wherein the time separated images are obtained using a CT Perfusion protocol having a reduced amount of contrast agent.
 26. A system for processing a plurality of time separated images comprising: an interface for receiving a plurality of time separated images; and a processing structure for selecting a plurality of imaging units in each image, determining a temporal difference for each imaging unit, and selecting temporal differences above a threshold limit.
 27. A computer readable medium embodying a computer program for processing a plurality of time separated images, the computer program comprising: computer program code for selecting a plurality of imaging units in each image; computer program code for determining a temporal difference for each imaging unit; and computer program code for selecting temporal differences above a threshold limit.
 28. A system for processing a plurality of time separated images according to the method of claim
 1. 